Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
arxiv.org·21h
Making a Language
thunderseethe.dev·4h
Simple Sudoku Solvers SII, EI: Dyalog APL
blog.veitheller.de·2d
Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
link.aps.org·19h
Subterms Modulo Theories I
philipzucker.com·3d
Loading...Loading more...